Achilles and the Tortoise Climbing up the Hyper-arithmetical Hierarchy Ecole Normale Supérieure De Lyon Achilles and the Tortoise Climbing up the Hyper-arithmetical Hierarchy

نویسنده

  • Olivier Bournez
چکیده

We pursue the study of the computational power of Piecewise Constant Derivative PCD systems started in PCD systems are dynamical systems de ned by a piecewise constant di erential equation and can be considered as computational machines working on a continuous space with a continuous time We prove that the languages recognized by rational PCD systems in dimension d k respectively d k k in nite continuous time are precisely the languages of the k th resp k th level of the hyper arithmetical hierarchy Hence the reachability problem for rational PCD systems of dimension d k resp d k k is hyper arithmetical and is k complete resp k complete

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Achilles and the Tortoise Climbing up the Hyper-Arithmetical Hierarchy

In this paper, we characterize the computational power of dynamical systems with piecewise constant derivatives (PCD) considered as computational machines working on a continuous real space with a continuous real time: we prove that piecewise constant derivative systems recognize precisely the languages of the ω th (respectively: ω + 1 th ) level of the hyper-arithmetical hierarchy in dimension...

متن کامل

Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy

In this paper we show how to construct for every set P of integers in the arithmetical hierarchy a dynamical system H with piecewise constant derivatives PCD such that deciding membership in P can be reduced to solving the reachability problem between two ratio nal points for H The ability of such apparently simple dynami cal systems whose de nition involves only rational parameters to solve hi...

متن کامل

Alternating Turing machines and the analytical hierarchy

We use notions originating in Computational Complexity to provide insight into the analogies between Computational Complexity and Higher Recursion Theory. We consider alternating Turing machines, but with a modified, global, definition of acceptance. We show that a language is accepted by such a machine iff it is inductive (Π1). Moreover, total alternating machines, which either accept or rejec...

متن کامل

The dynamics of individual nucleosomes controls the chromatin condensation pathway: direct AFM visualization of variant chromatin

Université de Lyon; Laboratoire Joliot-Curie, CNRS USR 3010, Ecole Normale Supérieure de Lyon, 46 allée d’Italie, 69364 Lyon Cedex 07, France ; Université de Lyon; Laboratoire de Physique, CNRS UMR 5672, Ecole Normale Supérieure de Lyon, 46 allée d’Italie, 69364 Lyon Cedex 07, France ; Université de Lyon; Laboratoire de Biologie Moléculaire de la Cellule, CNRS UMR 5239, Ecole Normale Supérieure...

متن کامل

Alternating Turing machines for inductive languages

We show that alternating Turing machines, with a novel and natural definition of acceptance, accept precisely the inductive (Π11) languages. Total alternating machines, that either accept or reject each input, accept precisely the hyper-elementary (∆11) languages. Moreover, bounding the permissible number of alternations yields a characterization of the levels of the arithmetical hierarchy. Not...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997